Solution Algorithm for Vehicle Routing Problem with Stochastic Demand
نویسندگان
چکیده
The vehicle routing problem (VRP) determines a delivery route that minimizes the cost. In this study, we consider stochastic VRP with uncertainty and variation in customer demand, which may cause shortage of products during delivery. case, vehicles have to return depot replenish products. We model sum additional cost caused by normal
منابع مشابه
Solution methodologies for vehicle routing problems with stochastic demand
We present solution methodologies for vehicle routing problems (VRPs) with stochastic demand, with a specific focus on the vehicle routing problem with stochastic demand (VRPSD) and the vehicle routing problem with stochastic demand and duration limits (VRPSDL). The VRPSD and the VRPSDL are fundamental problems underlying many operational challenges in the fields of logistics and supply chain m...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملThe Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be duration-feasible for all demand reali...
متن کاملAn algorithm for the vehicle routing problem with stochastic demands
Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. This research was support...
متن کاملThe Stochastic Vehicle Routing Problem for Minimum Unmet Demand
In this paper, we are interested in routing vehicles to minimize unmet demand with uncertain demand and travel time parameters. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of service and knowledge management
سال: 2023
ISSN: ['2189-9223', '2189-9231']
DOI: https://doi.org/10.52731/ijskm.v7.i2.710